Synchronizing Parallel Geometric Algorithms on Multi-Core Machines
نویسندگان
چکیده
منابع مشابه
Parallel Multi-Core Geometric Algorithms in CGAL
We describe an approach to efficiently use multiple processing cores and shared memory for several geometric algorithms. The d-dimensional algorithms we target are (a) spatial sorting of points, (b) kd-tree construction, (c) axis-aligned box intersection computation, and finally (d) bulk insertion of points in Delaunay triangulations. Underlying these comes also a thread-safe, efficient and mem...
متن کاملParallel support vector machines on multi-core and multiprocessor systems
This paper proposes a new and efficient parallel implementation of support vector machines based on decomposition method for handling large scale datasets. The parallelizing is performed on the most time-and-memory consuming work of training, i.e., to update the vector f . The inner problems are dealt by sequential minimal optimization solver. Since the underlying parallelism is realized by the...
متن کاملIssues in Implementation of Parallel Parsing on Multi-core Machines
The advent of multi-core architecture has highly influenced the area of high performance computing. Parallel compilation is the area which still needs significant improvement by the use of this architecture. Recent research has shown some improvement in lexical analysis phase. But it is difficult to implement the same technique in parsing phase. This paper highlights some issues related to impl...
متن کاملScalability of parallel finite element algorithms on multi-core platforms
The speedup of element-by-element FEM algorithms depends not only on peak processor performance but also on access time to shared mesh data. Eliminating memory boundness would significantly speed up unstructured mesh computations on hybrid multi-core architectures, where the gap between processor and memory performance continues to grow. The speedup can be achieved by ordering unknowns so that ...
متن کاملPoint-Based Value Iteration Algorithms for Multi-Core Machines
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods which quickly provide approximate solutions for medium-sized problems. New multi-core machines offer an opportunity to scale up to much larger domains. These machines support parallel execution and can speed up existing algorithms considerably. In this paper we suggest several ways in which p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Networking and Computing
سال: 2018
ISSN: 2185-2839,2185-2847
DOI: 10.15803/ijnc.8.2_240